A Formal Treatment of Generalized Preferential Attachment and its Empirical Validation
نویسندگان
چکیده
Generalized preferential attachment is defined as the tendency of a vertex to acquire new links in the future with respect to a particular vertex property. Understanding which properties influence link acquisition tendency (LAT) gives us a predictive power to estimate the future growth of network and insight about the actual dynamics governing the complex networks. In this study, we explore the effect of age and degree on LAT by analyzing data collected from a new complex-network growth dataset. We found that LAT and degree of a vertex are linearly correlated in accordance with previous studies. Interestingly, the relation between LAT and age of a vertex follows different forms for different values of the age. We identified three different periods in the network’s lifetime where the relation between age and LAT is strongly positive, almost stationary and negative correspondingly.
منابع مشابه
Joint estimation of preferential attachment and node fitness in growing complex networks
Complex network growth across diverse fields of science is hypothesized to be driven in the main by a combination of preferential attachment and node fitness processes. For measuring the respective influences of these processes, previous approaches make strong and untested assumptions on the functional forms of either the preferential attachment function or fitness function or both. We introduc...
متن کاملEmergence of tempered preferential attachment from optimization.
We show how preferential attachment can emerge in an optimization framework, resolving a long-standing theoretical controversy. We also show that the preferential attachment model so obtained has two novel features, saturation and viability, which have natural interpretations in the underlying network and lead to a power-law degree distribution with exponential cutoff. Moreover, we consider a g...
متن کاملLarge deviations, Basic information theorem for fitness preferential attachment random networks
For fitness preferential attachment random networks, we define the empirical degree and pair measure, which counts the number of vertices of a given degree and the number of edges with given fits, and the sample path empirical degree distribution. For the empirical degree and pair distribution for the fitness preferential attachment random networks, we find a large deviation upper bound. From t...
متن کاملMeasuring Generalized Preferential Attachment in Dynamic Social Networks
The mechanism of preferential attachment underpins most recent social network formation models. Yet few authors attempt to check or quantify assumptions on this mechanism. We call generalized preferential attachment any kind of preferential interaction behavior with respect to any node property, and introduce tools for measuring it empirically. We then apply them to the socio-semantic network o...
متن کاملHandout: Power Laws and Preferential Attachment
Empirical studies of real world networks revealed that degree distribution often follows a heavytailed distribution, a power law. At that time, there were two kinds of network models: the Erdos-Renyi random graph Gn,p and the Small World graphs of Watts and Strogatz. In both models the degrees were very close to the mean degree and there was little variation. Thus, there was the question of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/nlin/0609042 شماره
صفحات -
تاریخ انتشار 2006